package net.flintx.array;

import java.util.Arrays;

/**
 * Created by flintx on 2018/1/7.
 */
public class MergeSortedArray {
    public void merge(int[] nums1, int m, int[] nums2, int n) {
        /** 
         * merge
         *
         * @Description:
         *  Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
         *  Note:
         *  You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2.
         *  The number of elements initialized in nums1 and nums2 are m and n respectively.
         * @Example:
         * @Params: [nums1, m, nums2, n] 
         * @Return: void 
         * @Date: 2018/1/7 
         */

        int i = m - 1, j = n - 1, k = m + n - 1;
        while (i >= 0 && j >= 0) {
            if (nums1[i] > nums2[j]) {
                nums1[k--] = nums1[i--];
            } else {
                nums1[k--] = nums2[j--];
            }
        }
        while (j >= 0) {
            nums1[k--] = nums2[j--];
        }

    }

    public static void main(String[] args) {
        int[] nums1 = new int[20];
        nums1[0] = 1;
        nums1[1] = 3;
        nums1[2] = 5;
        nums1[3] = 7;
        nums1[4] = 9;
        int[] nums2 = {2, 4, 6, 8, 10, 11, 12, 13};
        new MergeSortedArray().merge(nums1, 5, nums2, nums2.length);
        System.out.println(Arrays.toString(nums1));
    }
}
